1851E - Nastya and Potions - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define s second
#define f first
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define V vector<ll>
#define VV vector<vector<ll>>
vector<ll> adj[200005+2];
ll cost[200005+2],ans[200005];

void dfs(ll p)
{
    if(ans[p]!=-1)return ;
    ll sum=0;
    for (auto u : adj[p])
    {
        dfs(u);
        sum+=ans[u];
    }
    if(adj[p].empty())ans[p]=cost[p];
    else ans[p]=min(sum,cost[p]);

}
int main()
{
   ll t=1;
   cin>>t;
    while(t--){
     ll n,k;
     cin>>n>>k;

     for(int i=1;i<=n;i++){cin>>cost[i];adj[i].clear();ans[i]=-1;}
     for(int i=1;i<=k;i++){ll x; cin>>x; cost[x]=0;}
     for(int i=1;i<=n;i++)
     {
         ll num;
         cin>>num;
         while(num--)
         {
             ll x;
             cin>>x;
             adj[i].pb(x);
         }
     }
     for(int i=1;i<=n;i++)dfs(i);
     for(int i=1;i<=n;i++)cout<<ans[i]<<" ";
     cout<<endl;
}
    return 0;
}